On the enumeration of partitions with summands in arithmetic progression
نویسندگان
چکیده
Enumerating formulae are constructed which count the number of partitions of a positive integer into positive summands in arithmetic progression with common difference D. These enumerating formulae (denoted pD(n)) which are given in terms of elementary divisor functions together with auxiliary arithmetic functions (to be defined) are then used to establish a known characterisation for an integer to possess a partition of the form in question.
منابع مشابه
On a phenomenon of Turán concerning the summands of partitions
Turán [12] proved that for almost all pairs of partitions of an integer, the proportion of common parts is very high, that is greater than 1 2 − ε with ε > 0 arbitrarily small. In this paper we prove that this surprising phenomenon persists when we look only at the summands in a fixed arithmetic progression.
متن کاملPartitions Into
§1 . Asymptotic estimates for the number of partitions of the integer n into summands chosen from an arithmetic progression have been derived by several authors, see for example Meinardus [3] . In this note we investigate a natural extension which has not previosusly appeared in the literature . We shall study the asymptotic behaviour of the numbers p a a (n) and q (n), the number of partitions...
متن کاملOn the Partitions of a Number into Arithmetic Progressions
The paper investigates the enumeration of the set AP(n) of partitions of a positive integer n in which the nondecreasing sequence of parts form an arithmetic progression. We establish formulas for such partitions, and characterize a class of integers n with the property that the length of every member of AP(n) divides n. We prove that the number of such integers is small.
متن کاملOn rainbow 4-term arithmetic progressions
{sl Let $[n]={1,dots, n}$ be colored in $k$ colors. A rainbow AP$(k)$ in $[n]$ is a $k$ term arithmetic progression whose elements have different colors. Conlon, Jungi'{c} and Radoiv{c}i'{c} cite{conlon} prove that there exists an equinumerous 4-coloring of $[4n]$ which is rainbow AP(4) free, when $n$ is even. Based on their construction, we show that such a coloring of $[4n]$...
متن کاملCombinatorics of Integer Partitions in Arithmetic Progression
The partitions of a positive integer n in which the parts are in arithmetic progression possess interesting combinatorial properties that distinguish them from other classes of partitions. We exhibit the properties by analyzing partitions with respect to a fixed length of the arithmetic progressions. We also address an open question concerning the number of integers k for which there is a k-par...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 28 شماره
صفحات -
تاریخ انتشار 2003